Extracting Exact Time Bounds from Logical Proofs
نویسندگان
چکیده
Accurate evaluation of delays of combinatorial circuits is crucial in circuit verification and design. In this paper we present a logical approach to timing analysis which allows us to compute exact stabilization bounds while proving the correctness of the boolean behavior.
منابع مشابه
Some Logical Metatheorems with Applications in Functional Analysis
In previous papers we have developed proof-theoretic techniques for extracting effective uniform bounds from large classes of ineffective existence proofs in functional analysis. Here ‘uniform’ means independence from parameters in compact spaces. A recent case study in fixed point theory systematically yielded uniformity even w.r.t. parameters in metrically bounded (but noncompact) subsets whi...
متن کاملStrongly uniform bounds from semi-constructive proofs
In [12], the second author obtained metatheorems for the extraction of effective (uniform) bounds from classical, prima facie nonconstructive proofs in functional analysis. These metatheorems for the first time cover general classes of structures like arbitrary metric, hyperbolic, CAT(0) and normed linear spaces and guarantee the independence of the bounds from parameters raging over metrically...
متن کاملThe logical structures of theological proofs, with an emphasis on the proof of love to God
This article has no abstract.
متن کاملProof Mining in R-trees and Hyperbolic Spaces
This paper is part of the general project of proof mining, developed by Kohlenbach. By ”proof mining” we mean the logical analysis of mathematical proofs with the aim of extracting new numerically relevant information hidden in the proofs. We present logical metatheorems for classes of spaces from functional analysis and hyperbolic geometry, like Gromov hyperbolic spaces, R-trees and uniformly ...
متن کاملLower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies
We prove an exponential lower bound on the size of static LovászSchrijver proofs of Tseitin tautologies. We use several techniques, namely, translating static LS+ proof into Positivstellensatz proof of Grigoriev et al., extracting a “good” expander out of a given graph by removing edges and vertices of Alekhnovich et al., and proving linear lower bound on the degree of Positivstellensatz proofs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001